Inexact trust region method for large sparse nonlinear least squares
نویسنده
چکیده
The main purpose of this paper is to show that linear least squares methods based on bidiagonalization, namely the LSQR algorithm, can be used for generation of trust region path. This property is a basis for an inexact trust region method which uses the LSQR algorithm for direction determination. This method is very efficient for large sparse nonlinear least squares as it is supported by numerical experiments.
منابع مشابه
Iterative Scaled Trust-Region Learning in Krylov Subspaces via Pearlmutter's Implicit Sparse Hessian-Vector Multiply
The online incremental gradient (or backpropagation) algorithm is widely considered to be the fastest method for solving large-scale neural-network (NN) learning problems. In contrast, we show that an appropriately implemented iterative batch-mode (or block-mode) learning method can be much faster. For example, it is three times faster in the UCI letter classification problem (26 outputs, 16,00...
متن کاملOn the convergence of an inexact Gauss-Newton trust-region method for nonlinear least-squares problems with simple bounds
We introduce an inexact Gauss-Newton trust-region method for solving bound-constrained nonlinear least-squares problems where, at each iteration, a trust-region subproblem is approximately solved by the Conjugate Gradient method. Provided a suitable control on the accuracy to which we attempt to solve the subproblems, we prove that the method has global and asymptotic fast convergence properties.
متن کاملJacobian-Free Three-Level Trust Region Method for Nonlinear Least Squares Problems
Nonlinear least squares (NLS) problems arise in many applications. The common solvers require to compute and store the corresponding Jacobian matrix explicitly, which is too expensive for large problems. In this paper, we propose an effective Jacobian free method especially for large NLS problems because of the novel combination of using automatic differentiation for J(x)v and J (x)v along with...
متن کاملComputing sparse Hessian and Jacobian approximations with optimal hereditary properties
In nonlinear optimization it is often important to estimate large sparse Hessian or Jacobian matrices, to be used for example in a trust region method. We propose an algorithm for computing a matrix B with a given sparsity pattern from a bundle of the m most recent diierence vectors = h k?m+1 : : : k i ; ? = h k?m+1 : : : k i ; where B should approximately map into ?. In this paper B is chosen ...
متن کاملA Parallel Nonlinear Additive Schwarz Preconditioned Inexact Newton Algorithm for Incompressible Navier-Stokes Equations ?
A nonlinear additive Schwarz preconditioned inexact Newton method (ASPIN) was introduced recently for solving large sparse highly nonlinear system of equations obtained from the discretization of nonlinear partial differential equations. In this paper, we discuss some extensions of ASPIN for solving the steady-state incompressible Navier-Stokes equations with high Reynolds numbers in the veloci...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Kybernetika
دوره 29 شماره
صفحات -
تاریخ انتشار 1993